#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n;
    cin >> n;
    V<int> w(n + 1, 0);
    FOR(i, 1, n) cin >> w[i];

    if (n == 1) {
        cout << w[1] << endl;
        RE;
    }

    int r = max_element(ALL(w)) - w.begin();

    if (r == 1) {
        int t = *max_element(ALL(w));
        FOR(i, 1, n) {
            if (w[i] == t - 1) {
                r = i;
            }
        }
    }

    V<int> res, ans;
    FOR(i, r, n) res.eb(w[i]);
    bool f = false;
    FOR(i, r + 1, n) ans.eb(w[i]);
    ans.eb(w[r]);
    FOR(i, 1, r - 1) ans.eb(w[i]);

    FORD(l, 1, r - 1) {
        V<int> tmp = res;
        FORD(i, l, r - 1) {
            tmp.eb(w[i]);
        }
        FOR(i, 1, l - 1) tmp.eb(w[i]);
        if (tmp > ans) {
            ans = tmp;
        }
    }

    for (auto x : ans) cout << x << ' ';
    cout << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
